- linear complexity
- линейная сложность ключевого потока (длина самого короткого регистра сдвига с линейной обратной связью)
English-Russian cryptological dictionary . 2014.
English-Russian cryptological dictionary . 2014.
Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… … Wikipedia
Linear temporal logic — (LTL) is a modal temporal logic with modalities referring to time. In LTL, one can encode formulae about the future of paths such as that a condition will eventually be true, that a condition will be true until another fact becomes true,… … Wikipedia
Complexity — For other uses, see Complexity (disambiguation). In general usage, complexity tends to be used to characterize something with many parts in intricate arrangement. The study of these complex linkages is the main goal of complex systems theory. In… … Wikipedia
Linear speedup theorem — In computational complexity theory, the linear speedup theorem for Turing machines proves that given any c > 0 and any Turing machine solving a problem in time f( n ), there is another machine that solves the same problem in time c f( n… … Wikipedia
Complexity class — In computational complexity theory, a complexity class is a set of problems of related resource based complexity. A typical complexity class has a definition of the form: the set of problems that can be solved by an abstract machine M using… … Wikipedia
Linear logic — In mathematical logic, linear logic is a type of substructural logic that denies the structural rules of weakening and contraction . The interpretation is of hypotheses as resources : every hypothesis must be consumed exactly once in a proof.… … Wikipedia
Linear Pottery culture — LBK redirects here. For other uses, see LBK (disambiguation). Not to be confused with Linear B. Map of European Neolithic at the apogee of Danubian expansion, c. 4500–4000 BC … Wikipedia
Linear programming relaxation — In mathematics, the linear programming relaxation of a 0 1 integer program is the problem that arises by replacing the constraint that each variable must be 0 or 1 by a weaker constraint, that each variable belong to the interval [0,1] .That is,… … Wikipedia
linear programming — Math. any of several methods for finding where a given linear function of several nonnegative variables assumes an extreme value and for determining the extreme value, the variable usually being subjected to constraints in the form of linear… … Universalium
Linear programming — Dieser Artikel oder Abschnitt ist nicht hinreichend mit Belegen (Literatur, Webseiten oder Einzelnachweisen) versehen. Die fraglichen Angaben werden daher möglicherweise demnächst gelöscht. Hilf Wikipedia, indem du die Angaben recherchierst und… … Deutsch Wikipedia
Linear time — In computational complexity theory, an algorithm is said to take linear time, or O( n ) time, if the asymptotic upper bound for the time it requires is proportional to the size of the input, which is usually denoted n . Informally spoken, the… … Wikipedia